in this paper, a new continuous ant colony optimization (caco) algorithm is proposed for optimal reservoir operation. the paper presents a new method of determining and setting a complete set of control parameters for any given problem, saving the user from a tedious trial and error based approach to determine them. the paper also proposes an elitist strategy for caco algorithm where best solut...

In this paper we establish necessary as well as sufficient conditions for a given feasible point to be a global minimizer of smooth minimization problems with mixed variables. These problems, for instance, cover box constrained smooth minimization problems and bivalent optimization problems. In particular, our results provide necessary global optimality conditions for difference convex minimiza...

This paper discusses the global minimization of rational functions with or without constraints. The sum of squares (SOS) relaxations are proposed to find the global minimum and minimizers. Some special features of the SOS relaxations are studied. As an application, we show how to find the nearest common divisors of polynomials via global minimization of rational functions. keywords: Rational fu...

ABSTRACT: Non-linear programming deals with the problem of optimizing an objective function in the presence of equality and inequality constraints. Most of the classical deterministic methods encounter two major problems: (i) the solution obtained is heavily dependent on the starting solution: and (ii) the methods often converge to inferior local optima. This paper examines the relationship bet...

Data association problem is of crucial importance to improve online target tracking performance in many difficult visual environments. Usually, association effectiveness is based on prior information and observation category. However, problems can happened when targets are quite similar. Therefore, neither the color, nor the shape could be helpful informations to achieve the task of data associ...